List Update Problem
نویسنده
چکیده
We present an optimal on-line algorithm for the List Update Problem when the request sequence has some particular structure.
منابع مشابه
Online Algorithms for Self-Organizing Sequential Search - A Survey
The main objective of this survey is to present the important theoretical and experimental results contributed till date in the area of online algorithms for the self organizing sequential search problem, also popularly known as the List Update Problem(LUP) in a chronological way. The survey includes competitiveness results of deterministic and randomized online algorithms and complexity result...
متن کاملOo-line Algorithms for the List Update Problem
Optimum oo-line algorithms for the list update problem are investigated. The list update problem involves implementing a dictionary of items as a linear list. Several characterizations of optimum algorithms are given; these lead to optimum algorithm which runs in time 2 n (n ? 1)!m, where n is the length of the list and m is the number of requests. The previous best algorithm, an adaptation of ...
متن کاملOff-Line Algorithms for the List Update Problem
Optimum oo-line algorithms for the list update problem are investigated. The list update problem involves implementing a dictionary of items as a linear list. Several characterizations of optimum algorithms are given; these lead to an implementation of an optimumalgorithm which runs in time O(2 n n!m), where n is the length of the list and m is the number or requests. The previous best algorith...
متن کاملList Update Problem by Béla Csaba
We present an optimal on-line algorithm for the List Update Problem when the request sequence has some particular structure.
متن کاملOffline List Update is NP-Hard
In the offline list update problem, we maintain an unsorted linear list used as a dictionary. Accessing the item at position i in the list costs i units. In order to reduce access cost, we are allowed to update the list at any time by transposing consecutive items at a cost of one unit. Given a sequence of requests one has to serve in turn, we are interested in the minimal cost needed to serve ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998